Maximum flow problem - PDFSEARCH.IO - Document Search Engine

Maximum flow problem
Results: 146

#	Item
51	Flows Advanced Algorithms – COMS31900 G = (V, E) is a directed graph with two special vertices s and t, where s is the source and t is the target. We write u → v to denote the directed edge from u to v . Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:21 Combinatorics Combinatorial optimization Maximum flow problem Flow network Ford–Fulkerson algorithm Max-flow min-cut theorem Cut Minimum cut Shortest path problem Network flow Graph theory Mathematics
52	Better bounds for matchings in the streaming model Michael Kapralov∗ July 26, 2012 Abstract In this paper we present improved bounds for approximating maximum matchings in bipartite graphs in Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:50 NP-complete problems Combinatorial optimization Matching Degree Maximum flow problem Graph coloring Dominating set Mathematics Graph theory Theoretical computer science
53	Master’s degree thesis 歩行者の衝突回避行動のシミュレーション Simulating the Collision Avoidance Behavior of Pedestrians Add to Reading List Source URL: www.logos.t.u-tokyo.ac.jp Language: English - Date: 2000-02-22 03:13:04 Traffic law Road safety Walking Locomotion Traffic Cul-de-sac Fluid dynamics Pedestrian Maximum flow problem Transport Land transport Road transport
54	Advanced Algorithms – COMS31900Lecture 15 Maximum flows and minimum cuts Markus Jalsenius Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:21 Combinatorics Flow network Maximum flow problem Push-relabel maximum flow algorithm Ford–Fulkerson algorithm Network flow Graph theory Mathematics
55	Specification Inference Using Context-Free Language Reachability Osbert Bastani Saswat Anand Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-02-24 02:42:36 Mathematics Combinatorics Flow network Dynamic programming Maximum flow problem Graph theory Network flow Operations research
56	Matching Theory Optimization Algorithm Experiments Add to Reading List Source URL: kui-tang.com Language: English Combinatorial optimization Matching Maximum flow problem Differential privacy Linear programming Bipartite graph Privacy Graph theory Mathematics Theoretical computer science
57	Survey of appropriate matching algorithms for large scale systems of differential algebraic equations Add to Reading List Source URL: www.ep.liu.se Language: English - Date: 2012-11-15 08:11:20 Matching Combinatorial optimization Hopcroft–Karp algorithm Pantelides algorithm Algorithm Modelica Maximum flow problem Adjacency matrix Differential algebraic equation Mathematics Theoretical computer science Graph theory
58	Distributed Flow Algorithms for Scalable Similarity Visualization Novi Quadrianto∗ , Dale Schuurmans† and Alex J. Smola‡ ∗ SML-NICTA & RSISE-ANU, Canberra, Australia Email: † Univer Add to Reading List Source URL: webdocs.cs.ualberta.ca Language: English - Date: 2010-12-15 01:15:39 Applied mathematics Operations research Combinatorial optimization Maximum flow problem Minimum-cost flow problem Flow network Linear programming Convex optimization Matching Mathematics Network flow Graph theory
59	Cooperative Weakest Link Games Yoram Bachrach Omer Lev Microsoft Research, Cambridge, UK Add to Reading List Source URL: www.ifaamas.org Language: English - Date: 2014-04-03 06:14:42 Game theory Network theory Operations research Combinatorial optimization Cooperative game Core Shortest path problem Maximum flow problem Graph Mathematics Graph theory Theoretical computer science
60	A General Approach to Online Network Optimization Problems Noga Alon∗ Baruch Awerbuch† Yossi Azar‡ Add to Reading List Source URL: www.cs.jhu.edu Language: English - Date: 2007-10-09 11:14:47 Combinatorial optimization NP-complete problems Spanning tree Analysis of algorithms Algorithms Randomized rounding Maximum flow problem Shortest path problem Steiner tree problem Theoretical computer science Mathematics Computational complexity theory